Multidimensional curve-fitting with self-organizing automata
نویسندگان
چکیده
منابع مشابه
Multidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملMultidimensional curve fitting to unorganized data points by nonlinear minimization
Many papers have addressed the problem of fitting curves to data points. However, most of the approaches are subject to a restriction that the data points must be ordered. The paper presents a method for generating a piecewise continuous parametric curve from a set of unordered and error-filled data points. The resulting curve not only provides a good fit to the original data but also possesses...
متن کاملMultidimensional Scaling and Kohonen's Self-organizing Maps
Two methods providing representation of high dimensional input data in a lower dimensional target space are compared Although multidimensional scaling MDS and Kohonen s self organizing maps SOM are dedicated to very di erent applications both methods are based on an iterative process that tends to approximate the topography of high dimensional data and both can be used to model self organizatio...
متن کاملPhysically Based, Self-Organizing Cellular Automata
A physically based system of interacting polyhedral objects i s used to model self-assembly and spontaneous organization of complex structures. The surfaces of the polyhedra in the simulation are covered with bonding sites in states akin to those of cellular automata. The bonding sites interact with sites on neighbouring polyhedra to apply forces of attraction and repulsion between bodies and t...
متن کاملModeling self-organizing traffic lights with elementary cellular automata
There have been several highway traffic models proposed based on cellular automata. The simplest one is elementary cellular automaton rule 184. We extend this model to city traffic with cellular automata coupled at intersections using only rules 184, 252, and 136. The simplicity of the model offers a clear understanding of the main properties of city traffic and its phase transitions. We use th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1962
ISSN: 0022-247X
DOI: 10.1016/0022-247x(62)90005-7